Many-Objective Container Stowage Optimization Based on Improved NSGA-III
نویسندگان
چکیده
The container ship stowage planning problem (CSPP) is a very complex and challenging issue concerning the interests of shipping companies ports. This article has developed many-objective CSPP solution that optimizes stability reduces number shifts over whole route while at same time considering realistic constraints such as physical structure layout yard. Use initial metacentric height (GM) along with ship’s heeling angle trim to measure its stability. Meanwhile, use total amount relocation in terminal yard, voluntary shift bay, necessary future unloading port on route. proposes variant nondominated sorting genetic algorithm III (NSGA-III) combined local search components solve this problem. can produce set non-dominated solutions, then decision-makers choose best practical implementation based their experience preferences. After carrying out large experiments 48 examples, our calculation results show effective compared NSGA-II random weighted algorithms, especially when applied CSPPs.
منابع مشابه
U-NSGA-III: A Unified Evolutionary Algorithm for Single, Multiple, and Many-Objective Optimization
Evolutionary algorithms (EAs) have been systematically developed to solve mono-objective, multi-objective and many-objective optimization problems, in this order, over the past few decades. Despite some efforts in unifying different types of mono-objective evolutionary and non-evolutionary algorithms, there does not exist many studies to unify all three types of optimization problems together. ...
متن کاملImproved Regularity Model-based EDA for Many-objective Optimization
The performance of multi-objective evolutionary algorithms deteriorates appreciably in solving many-objective optimization problems which encompass more than three objectives. One of the known rationales is the loss of selection pressure which leads to the selected parents not generating promising offspring towards Pareto-optimal front with diversity. Estimation of distribution algorithms sampl...
متن کاملMany objective optimization and hypervolume based search
Multiobjective optimization problems occur frequently in practice where multiple objectives have to be optimized simultaneously and the goal is to find or approximate the set of Pareto-optimal solutions. Multiobjective evolutionary algorithms (MOEAs) are one type of randomized search heuristics that are well-suited for multiobjective optimization problems due to their ability of computing a set...
متن کاملSubstitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Many-objective optimization refers to optimization problems with a number of objectives considerably larger than two or three. In this paper, a study on the performance of the Fast Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) for handling such many-objective optimization problems is presented. In its basic form, the algorithm is not well suited for the handling of a larger number o...
متن کاملConstraint-Based Local Search for Container Stowage Slot Planning
Due to the economical importance of stowage planning, there recently has been an increasing interest in developing optimization algorithms for this problem. We have developed 2-phase approach that in most cases can generate near optimal stowage plans within a few hundred seconds for large deep-sea vessels. This paper describes the constrainedbased local search algorithm used in the second phase...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Marine Science and Engineering
سال: 2022
ISSN: ['2077-1312']
DOI: https://doi.org/10.3390/jmse10040517